Scalable Loop Self-Scheduling Schemes for Heterogeneous Clusters
نویسندگان
چکیده
Distributed systems (e.g. a LAN of computers) can be used for concurrent processing for some applications. However, a serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Distributed scheduling schemes suitable for parallel loops with independent iterations on heterogeneous computer clusters have been proposed and analyzed in the past. Here, we implement the previous schemes in the CORBA (Orbix). We also present an extension of these schemes implemented in a hierarchical master-slave architecture. We present experimental results and comparisons.
منابع مشابه
A Parallel Loop Self-Scheduling on Extremely Heterogeneous PC Clusters
Cluster computers are a viable and less expensive alternative to symmetric multiprocessor systems. However, a serious difficulty in concurrent programming of a cluster computer system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Self-scheduling schemes suitable for parallel loops with independent iterations on heterogeneous com...
متن کاملDistributed loop-scheduling schemes for heterogeneous computer systems
Distributed computing systems are a viable and less expensive alternative to parallel computers. However, a serious difficulty in concurrent programming of a distributed system is how to deal with scheduling and load balancing of such a system which may consist of heterogeneous computers. Some distributed scheduling schemes suitable for parallel loops with independent iterations on heterogeneou...
متن کاملA Parallel Loop Scheduling for Extremely Heterogeneous PC Clusters
Cluster computers are becoming increasingly more common, especially with the increasing use of Beowulf systems, and networks of workstations (NOW) for parallel computing. Nowadays using cost-effective cluster computers to deal with problems which need large computing is a spreading trend. The major source of parallelism in a program is loops. If the loop iterations can be distributed to differe...
متن کاملEvaluation of Loop Scheduling Algorithms on DistributedMemory Systems
Loops are the largest source of parallelism in many applications. All prior DOALL loop scheduling algorithms such as Self-Scheduling, Guided Self-Scheduling, Trapezoid Self-Scheduling, and Factoring try to achieve workload balance through decreasing chunk sizes. Moreover, they have been analyzed only for shared memory platforms. In this work, the prior loop scheduling methods will be evaluated ...
متن کاملAn Enhanced Scheduling Approach in a Distributed Parallel Environment Using Mobile Agents
Hybrid System, A New Low Cost Parallel Cluster p. 28 Life with Ed: A Case Study of a Linux BIOS/BProc Cluster p. 35 Heterogeny in a Beowulf p. 42 Networks and Grids Self-Adaptive Parallel Processing Architecture for High-Speed Networking p. 45 Handoff in Mobile ATM Networks: A Framework for Performance Optimization p. 53 MetaGrid: A Scalable Framework for Wide-Area Service Deployment and Manage...
متن کامل